Complete pivoting strategy for the left-looking Robust Incomplete Factorization preconditioner
نویسندگان
چکیده
In this paper, we have used a complete pivoting strategy to compute the left-looking version of RIF preconditioner. This pivoting is based on the complete pivoting strategy of the IJK version of Gaussian Elimination process. There is a parameter α to control the pivoting process. To study the effect of α on the quality of the left-looking version of RIF preconditioner with complete pivoting strategy, we have used ten different values of this parameter. In the numerical experiments section, the quality of the left-looking version of RIF preconditioner with complete pivoting strategy has been compared to the quality of the right-looking version of this preconditioner. © 2014 Elsevier Ltd. All rights reserved.
منابع مشابه
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملComputing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملMultilevel ILU With Reorderings for Diagonal Dominance
This paper presents a preconditioning method based on combining two-sided permutations with a multilevel approach. The nonsymmetric permutation exploits a greedy strategy to put large entries of the matrix in the diagonal of the upper leading submatrix. The method can be regarded as a complete pivoting version of the incomplete LU factorization. This leads to an effective incomplete factorizati...
متن کاملOn Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems. In this paper, the focus is on extending the approach to sparse symmetric indefinite systems in saddle-point form. A limited-memory signed incomplete Cholesky factorization of the form LDL is proposed, where the diagonal matrix D has entries ±1. The main ad...
متن کاملNAG Fortran Library Routine Document F11DNF
F11DNF Note: before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details. 1 Purpose F11DNF computes an incomplete LU factorization of a complex sparse non-Hermitian matrix, represented in coordinate storage format. This factorization may be used as a preconditioner in combination w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 67 شماره
صفحات -
تاریخ انتشار 2014